Browsing by Subject "Computational geometry"
Now showing items 1-14 of 14
-
Article
Computational predictions of the tensile properties of electrospun fibre meshes: Effect of fibre diameter and fibre orientation
(2008)The mechanical properties of biomaterial scaffolds are crucial for their efficacy in tissue engineering and regenerative medicine. At the microscopic scale, the scaffold must be sufficiently rigid to support cell adhesion, ...
-
Conference Object
A computer simulation scenario analysis approach as a decision support tool for transportation systems planning
(2007)As the level of traffic congestion rises and the complexity of traffic networks increases, the development of effective transportation strategies becomes the most challenging task for every transport authority. Meanwhile, ...
-
Article
Conditioning of pseudospectral matrices for certain domain decompositions
(1999)In this paper we examine the conditioning of the matrices resulting from certain conforming pseudospectral approximations. In particular, we consider non-conforming domain decompositions in rectangular domains and the ...
-
Article
Curvilinear crosscuts of subdivision for a domain decomposition method in numerical conformal mapping
(1999)Let Q:= {Ω
-
Conference Object
A distributed algorithm for gathering many fat mobile robots in the plane
(2013)We revisit the problem of gathering autonomous robots in the plane. In particular, we consider non-transparent unit-disc robots (i.e., fat) in an asynchronous setting with vision as the only means of coordination and robots ...
-
Article
Image-based crowd rendering
(2002)Rendering crowded scenes with thousands of different animated virtual people in real time is challenging. An image-based rendering approach for displaying multiple avatars is proposed. The system allows real-time rendering ...
-
Conference Object
Integrated levels of detail
(2006)We introduce a new mesh representation for arbitrary surfaces that integrates different levels of detail into the final representation. It is produced after remeshing an existing model and omits storing connectivity ...
-
Article
A note on p/hp finite element methods for reaction-diffusion problems in polygonal domains
(2000)We present guidelines on how to choose the mesh and polynomial degree distribution for the approximation of reaction-diffusion problems in polygonal domains, in the context of the hp finite element method. These guidelines ...
-
Article
A p-version MITC finite element method for Reissner-Mindlin plates with curved boundaries
(2006)We consider the approximation of Reissner-Mindlin plates with curved boundaries, using a p-version MITC finite element method. We describe in detail the formulation and implementation of the method, and emphasize the need ...
-
Article
Potential field based geometric modelling using the method of fundamental solutions
(2006)We propose a new geometric modelling method based on the so-called potential field (PF) modelling technique. The harmonic problem associated with this technique is solved numerically using the method of fundamental solutions ...
-
Article
A spectral domain decomposition approach for steady Navier-Stokes problems in circular geometries
(1996)In this study, a spectral collocation domain decomposition method is developed for the numerical solution of second and fourth-order problems in circular domains. The method is applied to the Navier-Stokes equations and ...
-
Article
A survey of visibility for walkthrough applications
(2003)Visibility algorithms for walkthrough and related applications have grown into a significant area, spurred by the growth in the complexity of models and the need for highly interactive ways of navigating them. In this ...
-
Conference Object
View volume culling using a probabilistic caching scheme
(ACM, 1997)This paper a new algorithm for view volume culling. During an interactive walkthrough of a 3D scene, at any moment a large proportion of objects will be outside of the view volume. Frame-to-frame coherence implies that the ...
-
Conference Object
Viewspace partitioning of densely occluded scenes
(ACM, 1998)Computing the visibility of out-door scenes is often much harder than of in-door scenes. The difficulty is that although the majority of objects are hidden, some parts might be visible at a distance in an arbitrary location, ...